Sequential Circuits from Regular Expressions Revisited

Regular Expressions for Linear Sequential Circuits

Design and Test of New Robust QCA Sequential Circuits

   One of the several promising new technologies for computing at nano-scale is quantum-dot cellular automata (QCA). In this paper, new designs for different QCA sequential circuits are presented. Using an efficient QCA D flip-flop (DFF) architecture, a 5-bit counter, a novel single edge generator (SEG) and a divide-by-2 counter are implemented. Also, some types of oscillators, a new edge-t...

Compressed membership problems revisited

Membership problems for compressed strings in regular languages are investigated. Strings are represented by straight-line programs, i.e. contextfree grammars that generate exactly one string. For the representation of regular languages, various formalisms with different degrees of succinctness (e.g. suitably extended regular expressions, hierarchical automata) are considered. Precise complexit...

Performance Analysis of Reversible Sequential Circuits Based on Carbon NanoTube Field Effect Transistors (CNTFETs)

This study presents the importance of reversible logic in designing of high performance and low power consumption digital circuits. In our research, the various forms of sequential reversible circuits such as D, T, SR and JK flip-flops are investigated based on carbon nanotube field-effect transistors. All reversible flip-flops are simulated in two voltages, 0.3 and 0.5 Volt. Our results show t...

Synthesis of Sequential Extended Regular Expressions for Verification

Synthesis techniques take realizable Linear Temporal Logic specifications and produce correct circuits that implement the specifications. The generated circuits can be used directly, or as miters that check the correctness of a logic design. Typically, those techniques generate non-deterministic finite state automata, which can be determinized at a possibly exponential cost. Recent results show...